NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
991	Conflict-Guided Simplification for SAT Michael L. Case1,2 , Sanjit A. Seshia1 , Alan Mishchenko1 , and Robert K. Brayton1 1 2 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-01-31 13:42:07 Logic in computer science NP-complete problems Automated theorem proving Constraint programming Electronic design automation Boolean satisfiability problem Resolution Conjunctive normal form Satisfiability Modulo Theories Theoretical computer science Mathematics Applied mathematics
992	Efficient Influence Maximization in Social Networks Wei Chen Microsoft Research Asia Beijing, China Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:23 NP-complete problems Matroid theory Combinatorial optimization Graph coloring Network theory Shortest path problem Algorithm Randomized algorithm Greedy algorithm Mathematics Theoretical computer science Graph theory
993	Routing for Rural Health: Optimizing Community Health Worker Visit Schedules Emma Brunskill Neal Lesh Computer Science Division Add to Reading List Source URL: ai-d.org Language: English - Date: 2010-04-24 15:52:19 Planning Applied mathematics Mathematics Community health worker Vehicle routing problem Travelling salesman problem Scheduling Health care Routing Operations research Theoretical computer science NP-complete problems
994	Introduction Linearizations and Persistencies Lower Bounds Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2008-10-08 10:26:21 NP-complete problems Graph coloring Clique Graph partition Combinatorics Ising model Graph theory Theoretical computer science Mathematics
995	The Bidimensionality Theory and Its Algorithmic Applications by MohammadTaghi Hajiaghayi B.S., Sharif University of Technology, 2000 Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2005-07-24 15:36:22 NP-complete problems Analysis of algorithms Bidimensionality Parameterized complexity Planar graphs Tree decomposition Clique-sum Minor Branch-decomposition Graph theory Theoretical computer science Graph operations
996	Review of1 of The P = NP Question and Godel’s Lost Letter by Richard J. Lipton Springer, [removed]pages, Hardcover Review by Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-10-04 09:51:41 Complexity classes NP-complete problems Mathematical optimization Conjectures P versus NP problem Structural complexity theory NP Integer factorization Richard J. Lipton Theoretical computer science Computational complexity theory Applied mathematics
997	arXiv:0803.4321v1 [cs.DM] 30 Mar[removed]How good is the Warnsdorff’s knight’s tour heuristic? Samuel L. Marateck Department of Computer Science, New York University, Add to Reading List Source URL: xxx.lanl.gov Language: English - Date: 2011-08-05 19:30:18 NP-complete problems Hamiltonian path Path Graph theory Theoretical computer science Mathematics
998	Cost-effective Outbreak Detection in Networks Jure Leskovec Andreas Krause Carlos Guestrin Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 NP-complete problems Submodular set function Greedy algorithm Maximum coverage problem Heuristic function Algorithm Mathematics Combinatorics Applied mathematics
999	The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed] Add to Reading List Source URL: www.cs.rit.edu Language: English - Date: 2003-06-11 09:35:55 Complexity classes NP-complete problems Operations research Mathematical optimization Spanning tree Travelling salesman problem Minimum spanning tree NP-hard NP-complete Theoretical computer science Computational complexity theory Applied mathematics
1000	Finding community structure in very large networks Aaron Clauset,1 M. E. J. Newman,2 and Cristopher Moore1, 3 arXiv:cond-mat/0408187v2 [cond-mat.stat-mech] 30 Aug[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:24 Algebraic graph theory Network theory Networks NP-complete problems Modularity Graph partition Adjacency matrix Community structure Graph Mathematics Graph theory Theoretical computer science